Unavoidable Connected Matroids Retaining a Specified Minor
نویسندگان
چکیده
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Pou-Lin Wu showed that we can ensure that M has a big circuit or a big cocircuit containing any chosen element of M . In this paper, we begin with a fixed connected matroid N and we take M to be a connected matroid that has N as a minor. Our main result establishes that ifM is sufficiently large, then, up to duality, either M has a big connected minor in which N is a spanning restriction and the deletion of E(N) is a large connected uniform matroid, or M has as a minor the 2-sum of a big circuit and a connected single-element extension or coextension of N . In addition, we find a set of unavoidable minors for the class of graphs that have a cycle and a bond with a big intersection.
منابع مشابه
Unavoidable minors of large 4 - connected
11 It is known that any 3-connected matroid that is large enough is certain to contain 12 a minor of a given size belonging one of a few special classes of matroids. This 13 paper proves a similar unavoidable minor result for large 4-connected bicircular 14 matroids. The main result follows from establishing the list of unavoidable minors 15 of large 4-biconnected graphs, which are the graphs r...
متن کاملUnavoidable parallel minors of regular matroids
We prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M∗(K3,k), M(Wk), M(Kk), the cycle matroid of the graph obtained from K2,k by adding paths through the vertices of each vertex class, or the cycle matroid of the graph obtained from K3,k by adding a complete graph on the vertex class with three vertices.
متن کاملUnavoidable Parallel Minors and Series Minors of Regular Matroids
We prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M∗(K3,k), M(Wk), M(Kk), the cycle matroid of the graph obtained from K2,k by adding paths through the vertices of each vertex class, or the cycle matroid of the graph obtained from K3,k by adding a complete graph on the vertex class with three vertices.
متن کاملTowards a splitter theorem for internally 4-connected binary matroids II
Let M and N be internally 4-connected binary matroids such that M has a proper N -minor, and |E(N)| ≥ 7. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following result: if M\e has no N -minor whenever e is in a triangle of M , and M/e has no N -minor whenever e is in a triad of M , then M has a minor, M ′, such that M ′ is internal...
متن کاملThe Highly Connected Matroids in Minor-closed Classes
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the structural characterization. This paper is dedicated to James Oxley on the occasion of his 60th Birthday.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2016